An Affine-scaling Pivot Algorithm for Linear Programming
نویسندگان
چکیده
We proposed a pivot algorithm using the affine-scaling technique. It produces a sequence of interior points as well as a sequence of vertices, until reaching an optimal vertex. We report preliminary but favorable computational results obtained with a dense implementation of it on a set of standard Netlib test problems.
منابع مشابه
Linear Programming, the Simplex Algorithm and Simple Polytopes
In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.
متن کاملOn affine scaling and semi-infinite programming
In this note we are concerned with the generalization given by Ferris and Philpott [3] of the affine scaling algorithm discovered by Dikin [2] to solve semi-infinite linear programming problems, in which the number of variables is finite, but the number of constraints is not. In [3] a discrepancy is pointed out between the classical algorithm and its generalization. The purpose of this note is ...
متن کاملI . I . Dikin ' s Convergence Result for the Affine - Scaling Algorithm
The affine-scaling algorithm is an analogue of Karmarkar's linear programming algorithm that uses affine transformations instead of projective transformations. Although this variant lacks some of the nice properties of Karmarkar's algorithm (for example, it is probably not a polynomial-time algorithm). it nevertheless performs well in computer implementations. It has recently come to the attent...
متن کاملA simplified global convergence proof of the affine scaling algorithm*
This paper presents a simplified and self-contained global convergence proof for the affine scaling algorithm applied to degenerate linear programming problems. Convergence of the sequence of dual estimates to the center of the optimal diial face is also proven. In addition, we give a sharp rate of convergence result for the sequence of objective function values. All these results are proved wi...
متن کاملAn O(√nL) Iteration Bound Primal-Dual Cone Affine Scaling Algorithm for Linear Programming
In this paper we introduce a primal-dual affine scaling method. The method uses a searchdirection obtained by minimizing the duality gap over a linearly transformed conic section. This direction neither coincides with known primal-dual affine scaling directions [12, 21], nor does it fit in the generic primal-dual method [15]. The new method requires O(√nL) main iterations. It is shown that the ...
متن کامل